Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
نویسندگان
چکیده
منابع مشابه
A quantitative Doignon-Bell-Scarf theorem
The famous Doignon-Bell-Scarf theorem is a Helly-type result about the existence of integer solutions to systems of linear inequalities. The purpose of this paper is to present the following quantitative generalization: Given an integer k, we prove that there exists a constant c(n, k), depending only on the dimension n and k, such that if a bounded polyhedron {x ∈ Rn : Ax ≤ b} contains exactly ...
متن کاملInteger Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem
In this paper we study a generalization of the classical feasibility problem in integer linear programming, where an ILP needs to have a prescribed number of solutions to be considered solved. We first provide a generalization of the famous Doignon-Bell-Scarf theorem: Given an integer k, we prove that there exists a constant c(k, n), depending only on the dimension n and k, such that if a polyh...
متن کاملSublinear Bounds for Randomized Leader Election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...
متن کاملA Hierarchy of Lower Bounds for Sublinear Additive Spanners
Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say Õ(n) bits. There is an inherent tradeoff between the sparsity parameter δ and the stretch function f of the compression scheme, but the qualitative nature of this tradeoff has remained a persistent open problem. It has been known for some...
متن کاملA Bell - type Theorem Without Hidden Variables ∗
It is shown that no theory that satisfies certain premises can exclude faster-than-light influences. The premises include neither the existence of hidden variables, nor counterfactual definiteness, nor any premise that effectively entails the general existence of outcomes of unperformed local measurements. All the premises are compatible with Copenhagen philosophy, and the principles and predic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1100095